A Fast And Efficient Non-Blocking Coordinated Checkpointing Approach For Distributed Systems

In this paper, we have presented an efficient non-blocking coordinated checkpointing algorithm for distributed systems. The distinct advantages of the proposed algorithm are the following. It produces a consistent set of checkpoints, without the overhead of taking temporary checkpoints; the algorithm also makes sure that only few processes are required to take checkpoints in its any execution; it uses very few control messages, and the participating processes are interrupted fewer number of times when compared to some noted related works. These distinct advantages make the algorithm fast and efficient.